paraunitary matrices and group rings
نویسندگان
چکیده
design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. these include techniques for designing non-separable multidimensional paraunitary matrices. properties of the structures are obtained and proofs given. paraunitary matrices play a central role in signal processing, in particular in the areas of filterbanks and wavelets.
منابع مشابه
Paraunitary Matrices
Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the structures are obtained and proofs given. Paraunitary matrices play a central role in signal processing, in particular in the areas of filterbanks and wavelets.
متن کاملParaunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey’s Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time O(n logn). From a lower bound perspective, relatively little is known. Ailon shows in 2013 an Ω(n logn) bound for computing the normalized Fourier Transform assuming only unitary...
متن کاملA CCA secure cryptosystem using matrices over group rings
We propose a cryptosystem based on matrices over group rings and claim that it is secure against adaptive chosen ciphertext attack. 1. Cramer-Shoup cryptosystem The Cramer-Shoup cryptosystem is a generalization of ElGamal’s protocol. It is provably secure against adaptive chosen ciphertext attack (CCA). Moreover, the proof of security relies only on a standard intractability assumption, namely,...
متن کاملCryptanalysis of Some Protocols Using Matrices over Group Rings
It is important to search for easily implementable groups, for which the DL problem is hard and there is no known subexponential time algorithm for computing DL. The group of points over Fq of an elliptic curve is such a group. In [8], the group of invertible matrices with coefficients in a finite field was considered for such a key exchange. In [6], using the Jordan form it was shown that the ...
متن کاملPublic Key Exchange Using Matrices Over Group Rings
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but weuse (small) matrices over a group ring of a (small) symmetric group as the platform. This“nested structure” of the platform makes computation very efficient for legitimate parties.We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) andComputational Diffie-Hellman (CDH) p...
متن کاملCOTORSION DIMENSIONS OVER GROUP RINGS
Let $Gamma$ be a group, $Gamma'$ a subgroup of $Gamma$ with finite index and $M$ be a $Gamma$-module. We show that $M$ is cotorsion if and only if it is cotorsion as a $Gamma'$-module. Using this result, we prove that the global cotorsion dimensions of rings $ZGamma$ and $ZGamma'$ are equal.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of group theoryناشر: university of isfahan
ISSN 2251-7650
دوره 3
شماره 1 2014
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023